Understanding and Addressing the Unbounded “Likelihood” Problem
نویسندگان
چکیده
The joint probability density function, evaluated at the observed data, is commonly used as the likelihood function to compute maximum likelihood estimates. For some models, however, there exist paths in the parameter space along which this densityapproximation likelihood goes to infinity and maximum likelihood estimation breaks down. In applications, all observed data are discrete due to the round-off or grouping error of measurements. The “correct likelihood” based on interval censoring can eliminate the problem of an unbounded likelihood. This paper categorizes the models leading to unbounded likelihoods into three groups and illustrates the density breakdown with specific examples. We also study the effect of the round-off error on estimation, and give a sufficient condition for the joint density to provide the same maximum likelihood estimate as the correct likelihood, as the round-off error goes to zero.
منابع مشابه
Axisymmetric Scaled Boundary Finite Element Formulation for Wave Propagation in Unbounded Layered Media
Wave propagation in unbounded layered media with a new formulation of Axisymmetric Scaled Boundary Finite Element Method (AXI-SBFEM) is derived. Dividing the general three-dimensional unbounded domain into a number of independent two-dimensional ones, the problem could be solved by a significant reduction in required storage and computational time. The equations of the corresponding Axisymmetri...
متن کاملSOLVING SINGULAR ODES IN UNBOUNDED DOMAINS WITH SINC-COLLOCATION METHOD
Spectral approximations for ODEs in unbounded domains have only received limited attention. In many applicable problems, singular initial value problems arise. In solving these problems, most of numerical methods have difficulties and often could not pass the singular point successfully. In this paper, we apply the sinc-collocation method for solving singular initial value problems. The ability...
متن کاملAddressing the Freight Consolidation and Containerization Problem by Recent and Hybridized Meta-heuristic Algorithms
Nowadays, in global free market, third-party logistics providers (3PLs) are becoming increasingly important. Hence, this study aims to develop the freight consolidation and containerization problem, which consists of loading items into containers and then shipping these containers to different warehouse they are delivered to their final destinations. In order to handle the proposed problem, thi...
متن کاملAddressing a Coordinated Quay Crane Scheduling and Assignment Problem by Red Deer Algorithm
Nowadays, there is much attention for planning of container terminals in the global trade centers. The high cost of quay cranes motivates both scholars and industrial practitioners especially in the last decade to develop novel optimization models to address this dilemma. This study proposes a coordinated optimization model to cover both Quay Crane Scheduling Problem (QCSP) and Quay Crane Assig...
متن کاملSome results about unbounded convergences in Banach lattices
Suppose E is a Banach lattice. A net in E is said to be unbounded absolute weak convergent ( uaw-convergent, for short) to provided that the net convergences to zero, weakly. In this note, we further investigate unbounded absolute weak convergence in E. We show that this convergence is stable under passing to and from ideals and sublattices. Compatible with un-convergenc, we show that ...
متن کامل